Expansion properties of a random regular graph after random vertex deletions
نویسندگان
چکیده
منابع مشابه
Expansion properties of a random regular graph after random vertex deletions
We investigate the following vertex percolation process. Starting with a random regular graph of constant degree, delete each vertex independently with probability p, where p = n−α and α = α(n) is bounded away from 0. We show that a.a.s. the resulting graph has a connected component of size n− o(n) which is an expander, and all other components are trees of bounded size. Sharper results are obt...
متن کاملExpansion properties of random Cayley graphs and vertex transitive graphs
The Alon-Roichman theorem states that for every ε > 0 there is a constant c(ε), such that the Cayley graph of a finite group G with respect to c(ε) log |G| elements of G, chosen independently and uniformly at random, has expected second largest eigenvalue less than ε. In particular, such a graph is an expander with high probability. Landau and Russell, and independently Loh and Schulman, improv...
متن کاملRegular induced subgraphs of a random Graph
An old problem of Erdős, Fajtlowicz and Staton asks for the order of a largest induced regular subgraph that can be found in every graph on n vertices. Motivated by this problem, we consider the order of such a subgraph in a typical graph on n vertices, i.e., in a binomial random graph G(n, 1/2). We prove that with high probability a largest induced regular subgraph of G(n, 1/2) has about n ver...
متن کاملVertex Degree of Random Intersection Graph
A random intersection graph is constructed by independently assigning a subset of a given set of objects W, to each vertex of the vertex set V of a simple graph G. There is an edge between two vertices of V, iff their respective subsets(in W ,) have at least one common element. The strong threshold for the connectivity between any two arbitrary vertices of vertex set V, is derived. Also we dete...
متن کاملThe expansion of random regular graphs
Our aim is now to show that for any d ≥ 3, almost all d-regular graphs on {1, 2, . . . , n} have edge-expansion ratio at least cdd (if nd is even), where cd > 0 depends only upon d. (In fact, we will see that we can take cd ≥ 0.18 for all d ≥ 3, and cd → 1/2 as d → ∞.) More precisely, if G(n, d) denotes a (uniform) random d-regular graph on [n], meaning a (labelled) d-regular graph on [n] chose...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2008
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2007.06.021